Solving subgraph isomorphism problems with constraint programming

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A constraint programming approach to subgraph isomorphism

ions for sets. Filtering and propagators A simple algorithm exists to find a solution to a CSP. A straightforward idea is to enumerate all assignments of the variables with respect to their domains, and check if the constraints are satisfied. This strategy is correct, but the time to find a solution is exponential. Individual constraints can be used to remove values. Values in the domain of a C...

متن کامل

Solving Set Partitioning Problems with Constraint Programming

This paper investigates the potential of constraint programming for solving set partitioning problems occurring in crew scheduling, where constraint programming is restricted to not employ external solvers, as for instance integer linear programming solvers. We evaluate preprocessing steps known from the OR literature on moderately sized set partitioning problems. Further, we propose a new prep...

متن کامل

Solving Frequency Assignment Problems with Constraint Programming

The topic of this diploma thesis is the solving of a Frequency Assignment Problem (FAP) in GSM radio networks by means of Constraint Programming. The task of frequency planning is the assignment of frequencies to base stations w.r.t. various constraints such that interference, which may have a substantial impact on the quality of the received signals, is avoided as far as possible. Constraint P...

متن کامل

Hardware Accelerator for Subgraph Isomorphism Problems

Many applications can be m o deled a s s u b graph iso-morphism problems, which are g e n e r ally NP-complete. This paper presents an algorithm that is suited for hardware implementation. The prototype a c celerator that operates at 16.5 MHz on a Lucent ORCA 2C15A FPGA outperforms the software implementation of Ullmann's algorithm on a 400 MHz Pentium II by 10 times in the best case. 1 Subgrap...

متن کامل

Solving Balancing and Bin-Packing problems with Constraint Programming

This work could not have been achieved without the support of the following persons. My parents who encourage me to finish this thesis (even by coming in Providence). They are great example for their five children. My wife Caro who supports me everyday. She's always there to remind me what is the most important in my life and helps me to find a good balance between work, family and friends. Yve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Constraints

سال: 2009

ISSN: 1383-7133,1572-9354

DOI: 10.1007/s10601-009-9074-3